#include<bits/stdc++.h>
using namespace std;
class Solution {
public:
    vector<int> largestDivisibleSubset(vector<int>& nums) {
        vector<vector<int>> dp(nums.size());
        sort(nums.begin(), nums.end());
        int maxNum = 0;
        for(int i = 0; i < nums.size(); i++){
            //创建自己的结果集
            vector<int> t;
            dp[i] = t;
            dp[i].push_back(nums[i]);
            //开始寻找最大的子集
            int index = -1;
            int subMax = -1;
            for (int j = i - 1; j >= 0; j--) {
                if (nums[i] % nums[j] == 0) {
                    if (subMax < (int)dp[j].size()) {
                       subMax = (int)dp[j].size();
                       index  = j;
                    }
                }
            }
            //如果找到了， 就逐个添加
            if(index != -1)
            {
                vector<int> t = dp[index];
                for(auto num : t)
                    dp[i].push_back(num);
                cout << t.size();
            }
            int len = dp[i].size();
            maxNum = max(maxNum, len);
        }

        //对最后结果的处理
        for(int i = 0; i < nums.size(); i++){
            if(dp[i].size() == maxNum)
                return dp[i];
        }
        vector<int> v;
        return v;
    }
};

void trimLeftTrailingSpaces(string &input) {
    input.erase(input.begin(), find_if(input.begin(), input.end(), [](int ch) {
        return !isspace(ch);
    }));
}

void trimRightTrailingSpaces(string &input) {
    input.erase(find_if(input.rbegin(), input.rend(), [](int ch) {
        return !isspace(ch);
    }).base(), input.end());
}

vector<int> stringToIntegerVector(string input) {
    vector<int> output;
    trimLeftTrailingSpaces(input);
    trimRightTrailingSpaces(input);
    input = input.substr(1, input.length() - 2);
    stringstream ss;
    ss.str(input);
    string item;
    char delim = ',';
    while (getline(ss, item, delim)) {
        output.push_back(stoi(item));
    }
    return output;
}

string integerVectorToString(vector<int> list, int length = -1) {
    if (length == -1) {
        length = list.size();
    }

    if (length == 0) {
        return "[]";
    }

    string result;
    for(int index = 0; index < length; index++) {
        int number = list[index];
        result += to_string(number) + ", ";
    }
    return "[" + result.substr(0, result.length() - 2) + "]";
}

int main() {
    string line;
    while (getline(cin, line)) {
        vector<int> nums = stringToIntegerVector(line);
        
        vector<int> ret = Solution().largestDivisibleSubset(nums);

        string out = integerVectorToString(ret);
        cout << out << endl;
    }
    return 0;
}